On •-line signed graphs L_{•}(S)
نویسندگان
چکیده
منابع مشابه
on $bullet$-lict signed graphs $l_{bullet_c}(s)$ and $bullet$-line signed graphs $l_bullet(s)$
a emph{signed graph} (or, in short, emph{sigraph}) $s=(s^u,sigma)$ consists of an underlying graph $s^u :=g=(v,e)$ and a function $sigma:e(s^u)longrightarrow {+,-}$, called the signature of $s$. a emph{marking} of $s$ is a function $mu:v(s)longrightarrow {+,-}$. the emph{canonical marking} of a signed graph $s$, denoted $mu_sigma$, is given as $$mu_sigma(v) := prod_{vwin e(s)}sigma(vw).$$the li...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کاملCharacterization of line-consistent signed graphs
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e., edge-signed graphs whose line graphs, with the naturally induced vertex signature, are consistent. Their proof applies Hoede’s relatively di...
متن کاملConstruction of Line-Consistent Signed Graphs
The line graph of an edge-signed graph carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized edge-signed graphs whose line graphs are consistent. Their proof applies Hoede’s relatively difficult characterization of consistent vertex-signed graphs. We give a different, constr...
متن کاملCharacterization of Signed Graphs whose Iterated Signed Line Graphs are Balanced or S−Consistent
A signed graph is a graph in which every edge is designated to be either positive or negative; it is balanced if every cycle contains an even number of negative edges. A marked signed graph is a signed graph each vertex of which is designated to be positive or negative, and it is consistent if every cycle in the signed graph possesses an even number of negative vertices. Signed line graph L(S) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2015
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1793